Simulation of Exit Selection Behavior Using Least Effort Algorithm
نویسندگان
چکیده
منابع مشابه
An Analytical Model for Predicting the Convergence Behavior of the Least Mean Mixed-Norm (LMMN) Algorithm
The Least Mean Mixed-Norm (LMMN) algorithm is a stochastic gradient-based algorithm whose objective is to minimum a combination of the cost functions of the Least Mean Square (LMS) and Least Mean Fourth (LMF) algorithms. This algorithm has inherited many properties and advantages of the LMS and LMF algorithms and mitigated their weaknesses in some ways. The main issue of the LMMN algorithm is t...
متن کاملImprovement of effort estimation accuracy in software projects using a feature selection approach
In recent years, utilization of feature selection techniques has become an essential requirement for processing and model construction in different scientific areas. In the field of software project effort estimation, the need to apply dimensionality reduction and feature selection methods has become an inevitable demand. The high volumes of data, costs, and time necessary for gathering data , ...
متن کاملAlgorithm Selection Using Performance and Run Time Behavior
In data mining, an important early decision for a user to make is to choose an appropriate technique for analyzing the dataset at hand so that generalizations can be learned. Intuitively, a trial-and-error approach becomes impractical when the number of data mining algorithms is large while experts’ advice to choose among them is not always available and affordable. Our approach is based on met...
متن کاملPlanning Using Least Commitment to Operator Selection
One aspect that separates real planning problems from toy problems is that solutions to real problems must be not only correct but also efficient and high quality. In this paper, we will describe the Least Commitment Operator Selection (LCOS) strategy which enables planners to construct globally optimal plans. The LCOS was developed from studies of human expert planners solving complex problems...
متن کاملModel Selection for Regularized Least-Squares Algorithm in Learning Theory
We investigate the problem of model selection for learning algorithms depending on a continuous parameter. We propose a model selection procedure based on a worst case analysis and data-independent choice of the parameter. For regularized least-squares algorithm we bound the generalization error of the solution by a quantity depending on few known constants and we show that the corresponding mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2014
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2014.09.093